Finding level-ancestors in trees
نویسندگان
چکیده
منابع مشابه
Finding Level-Ancestors in Trees
The level-ancestor problem is considered. Suppose a rooted tree T is given for preprocessing. Answer quickly queries of the following form. Given a vertex v and an integer i > 0, find the ith vertex on the path from v to the root. Given any m, 1 ~<m~<log* n, we achieve the following results: (1) O(log (m) n) a time using an optimal number of processors for preprocessing and constant time using ...
متن کاملWeighted Ancestors in Suffix Trees
The classical, ubiquitous, predecessor problem is to construct a data structure for a set of integers that supports fast predecessor queries. Its generalization to weighted trees, a.k.a. the weighted ancestor problem, has been extensively explored and successfully reduced to the predecessor problem. It is known that any solution for both problems with an input set from a polynomially bounded un...
متن کاملMarkovian simulation for ancestors trees
We present a computational model to reconstruct ancestor trees of animals with sexual reproduction following the theoretical model presented in Phys. Rev. E 90, 022125 (2014). Through a recursive algorithm combined with a random number generator, it is possible to reproduce the number of ancestor for each generation and use it to constraint a maximum number of the following generation. This sim...
متن کاملFinding Common Ancestors and Disjoint Paths in DAGs
We consider the problem of finding pairs of vertex-disjoint paths in a DAG, either connecting two given nodes to a common ancestor, or connecting two given pairs of terminals. It was known how to find a single pair of paths, for either type of input, in polynomial time. We show how to find the k pairs with shortest combined length, in time O(mn + k). We also show how to count all such pairs of ...
متن کاملLowest Common Ancestors in Trees and Directed Acyclic Graphs1
We study the problem of finding lowest common ancestors (LCA) in trees and directed acyclic graphs (DAGs). Specifically, we extend the LCA problem to DAGs and study the LCA variants that arise in this general setting. We begin with a clear exposition of Berkman and Vishkin’s simple optimal algorithm for LCA in trees. The ideas presented are not novel theoretical contributions, but they lay the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1994
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(05)80002-9